Search results for "Polynomial algorithm"

showing 2 items of 2 documents

An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph

2001

International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.

HypergraphProperty (philosophy)General Computer Science[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]0102 computer and information sciences02 engineering and technologyComputer Science::Computational Geometry01 natural sciencesPolynomial algorithmTheoretical Computer ScienceCombinatorics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI][ INFO.INFO-DC ] Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Computer Science::Discrete Mathematics[ INFO.INFO-TI ] Computer Science [cs]/Image Processing0202 electrical engineering electronic engineering information engineeringMathematics::Metric GeometryComputingMilieux_MISCELLANEOUSMathematicsIncidence (geometry)Discrete mathematicsMathematics::CombinatoricsEfficient algorithm16. Peace & justice010201 computation theory & mathematics[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]Bipartite graph020201 artificial intelligence & image processing[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Computer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct

A polynomial algorithm solving a special class of hybrid optimal control problems

2006

Hybrid optimal control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions [5]. In this paper, we identify a special class of hybrid optimal control problems which are easy to solve. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the hybrid optimal control problem via an integer-linear programming reformulation. The integer-linear programming problem is a Set-covering one with a totally unimodular constraint matrix and therefore solving the S…

EngineeringMathematical optimizationForce densityComputational complexity theoryLinear programmingbusiness.industrySpecial classOptimal controlPolynomial algorithmControllabilityHybrid optimal controlAlgorithmsHybrid computersInteger programmingLinear control systemsUnimodular matrixControl theoryHuman machine interactionLocal search (optimization)Relaxation (approximation)Settore MAT/09 - Ricerca OperativabusinessInteger programmingTime complexityMathematics2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control
researchProduct